Large Scale Evaluation of Natural Language Processing Based Test-to-Code Traceability Approaches
نویسندگان
چکیده
Traceability information can be crucial for software maintenance, testing, automatic program repair, and various other engineering tasks. Customarily, a vast amount of test code is created systems to maintain improve quality. Today's may contain tens thousands tests. Finding the parts tested by each case usually difficult time-consuming task without help authors tests or at least clear naming conventions. Recent test-to-code traceability research has employed approaches but textual methods as standalone techniques were investigated only marginally. The convention approach well-regarded method among developers. Besides their often voluntary use, however, one its main weaknesses that it identify one-to-one links. With use more versatile text-based methods, candidates could ranked similarity, thus producing number possible connections. Textual also have disadvantages, even machine learning provide semantically connected links from text itself, these refined with incorporation structural information. In this paper, we investigate applicability three both link recovery technique regarding combination possibilities paper presents an extensive evaluation using several source representations meta-parameter settings on eight real, medium-sized combined size over 1.25 million lines code. Our results suggest suitable settings, used purposes, where conventions not followed.
منابع مشابه
Similarity-Based Approaches to Natural Language Processing
Statistical methods for automatically extracting information about associations between words or documents from large collections of text have the potential to have considerable impact in a number of areas, such as information retrieval and natural-language-based user interfaces. However, even huge bodies of text yield highly unreliable estimates of the probability of relatively common events, ...
متن کاملUsing natural language processing to construct large - scale hypertext systems
theory of how texts are connected (a theory of text association) and partial theories of what the text is describing (domain theories). However, systems built in this way, such as ASK Systems [Ferguson, et al . 1992], are difficult to build even when the domain theories and a theory of text association are in place . Natural language understanding technologies that take advantage of underlying ...
متن کاملConnectionist Approaches to Natural Language Processing
With the growing popularity of statistical approaches to natural language processing, it is natural to consider how connectionist techniques for learning and using soft constraints might be applicable to this area. However, nagging questions about the representational and computational adequacy of connectionist networks for processing language make the fruitfulness of this endeavor uncertain. T...
متن کاملLarge - Scale Semi - Supervised Learning for Natural Language Processing
Natural Language Processing (NLP) develops computational approaches to processing language data. Supervised machine learning has become the dominant methodology of modern NLP. The performance of a supervised NLP system crucially depends on the amount of data available for training. In the standard supervised framework, if a sequence of words was not encountered in the training set, the system c...
متن کاملNatural Language Processing based Automatic Multilingual Code Generation
Unified modeling language is being used as a premier tool for modeling the user requirements. These CASE tools provide an easy way to get efficient solutions. This paper presents a natural language processing based automated system for generating code in multilanguages after modeling the user requirements based on UML. UML diagrams are first generated by analyzing the given business scenario pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3083923